Recognizing Leveled-Planar Dags in Linear Time
نویسندگان
چکیده
منابع مشابه
Stack and Queue Layouts of Directed Acyclic Graphs: Part II
Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags). A stack layout of a dag is similar to a stack layout of an undirected graph, with the additional requirement...
متن کاملSimultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs
In this paper, we consider the RedBluePath problem, which states that given a graph G whose edges are colored either red or blue and two fixed vertices s and t in G, is there a path from s to t in G that alternates between red and blue edges. The RedBluePath problem in planar DAGs is NL-complete. We exhibit a polynomial time and O(n 1 2 + ) space algorithm (for any > 0) for the RedBluePath prob...
متن کاملLongest Paths in Planar DAGs in Unambiguous Logspace
We present a transformation from longest paths to shortest paths in sub-classes of directed acyclic graphs (DAGs). The transformation needs log-space and oracle access to reachability in the same class of graphs. As a corollary, we obtain our main result: Longest Paths in planar DAGs is in UL ∩ co-UL. The result also extends to toroidal DAGs. Further, we show that Longest Paths in max-unique DA...
متن کاملA Mathematical Modeling for Plastic Analysis of Planar Frames by Linear Programming and Genetic Algorithm
In this paper, a mathematical modeling is developed for plastic analysis of planar frames. To this end, the researcher tried to design an optimization model in linear format in order to solve large scale samples. The computational result of CPU time requirement is shown for different samples to prove efficiency of this method for large scale models. The fundamental concept of this model is ob...
متن کاملLevel Planarity Testing in Linear Time
In a leveled directed acyclic graph G = (V, E) the vertex set V is partitioned into k ≤ |V | levels V1, V2, . . . , Vk such that for each edge (u, v) ∈ E with u ∈ Vi and v ∈ Vj we have i < j. The level planarity testing problem is to decide if G can be drawn in the plane such that for each level Vi, all v ∈ Vi are drawn on the line li = {(x, k−i) | x ∈ R}, the edges are drawn monotone with resp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995